Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
نویسندگان
چکیده
منابع مشابه
Max-planck-institut F Ur Informatik Theorem Proving in Cancellative Abelian Monoids Publication Notes
We describe a re ned superposition calculus for cancellative abelian monoids. They encompass not only abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Both the AC axioms and the cancellation law are di cult for a general purpose superposition theorem prover, as they create many variants of clauses which contain sums. Our calculus requires neither explicit...
متن کاملRefutational Theorem Proving Using Term-Rewriting Systems
In this paper we propose a new approach to theorem proving in first-order logic based on the term-rewriting method. First for propositional calculus, we introduce a canonical term-rewriting system for Boolean algebra. This system enables us to transform the first-order predicate calculus into a form of equational logic, and to develop several complete strategies (both clausal and nonclausal) fo...
متن کاملGraph Products of Right Cancellative Monoids
Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or empty, then so does the graph product. Our second main result gives a presentation for the inverse hull of such a graph product. We then specialise to the ca...
متن کاملRight Cancellative and Left Ample Monoids: Quasivarieties and Proper Covers
The aim of this paper is to study certain quasivarieties of left ample monoids. Left ample monoids are monoids of partial one–one mappings of sets closed under the operation α 7→ αα−1. The idempotents of a left ample monoid form a semilattice and have a strong influence on the structure of the monoid; however, a left ample monoid need not be inverse. Every left ample monoid has a maximum right ...
متن کاملAnother look at automated theorem-proving II
I continue the discussion initiated in [22] of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers that describe automated security proofs for hashed ElGamal encryption, Boneh-Franklin identity-based encryption, and OAEP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0537